Cryptographic Pseudo-Random Sequences from the Chaotic Henon Map
نویسنده
چکیده
A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Hénon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and auto-correlation are investigated. All these properties of the sequences suggest a strong resemblance to random sequences. Results of statistical testing of the sequences are found encouraging. An attempt is made to estimate the keyspace size if the proposed scheme is used for cryptographic applications. The keyspace size is found to be large and is dependent on the precision of the computing platform used.
منابع مشابه
A Very Efficient Pseudo-Random Number Generator Based On Chaotic Maps and S-Box Tables
Generating random numbers are mainly used to create secret keys or random sequences. It can be carried out by various techniques. In this paper we present a very simple and efficient pseudo random number generator (PRNG) based on chaotic maps and S-Box tables. This technique adopted two main operations one to generate chaotic values using two logistic maps and the second to transform them into ...
متن کاملA Pseudo-Random Bit Generator Using Three Chaotic Logistic Maps
A novel pseudo-random bit generator (PRBG) using three chaotic logistic maps is proposed. The algorithm generates at each iteration sequences of 32 bit-blocks by starting from randomly chosen initial seeds. The impact of relying on IEEE 754-2008 floating-point representation format for the generator is also taken into account. The performance of the generator is evaluated through various statis...
متن کاملA New Pseudo-Random Number Generator Based on Two Chaotic Maps
A new pseudo-random number generator (PRNG) is proposed. The principle of the method consists in mixing chaotic maps produced from an input initial vector. The algorithm uses permutations whose positions are computed and indexed by a chaotic function based on linear congruences. The performance of this scheme is evaluated through statistical analysis. Such a cryptosystem lets appear significant...
متن کاملChaos of Henon Map Based on the Coupled Networks
In this paper, the relationship between the parameters of Henon map is studied, and the chaos of Henon map is also discussed based on different coupled networks. From the simulate results, we found with the increasing of parameter a the chaos of Henon map will be emerged. At the same time, the transition from non-chaotic to chaotic in coupled networks is exhibited, although the parameters in no...
متن کاملImage encryption based on chaotic tent map in time and frequency domains
The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0604018 شماره
صفحات -
تاریخ انتشار 2006